High Performance Integer Optimization for Crew Scheduling

نویسندگان

  • Peter Sanders
  • Tuomo Takkula
  • Dag Wedelin
چکیده

Performance aspects of a Lagrangian relaxation based heuris-tic for solving large 0-1 integer linear programs are discussed. In particular , we look at its application to airline and railway crew scheduling problems. We present a scalable parallelization of the original algorithm used in production at Carmen Systems AB, GG oteborg, Sweden, based on distributing the variables and a new sequential active set strategy which requires less work and is better adapted to the memory hierachy properties of modern RISC processors. The active set strategy can even be parallelized on networks of workstations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Performance Integer Optimization

Performance aspects of a Lagrangian relaxation based heuris-tic for solving large 0-1 integer linear programs are discussed. In particular , we look at its application to airline and railway crew scheduling problems. We present a scalable parallelization of the original algorithm used in production at Carmen Systems AB, GG oteborg, Sweden, based on distributing the variables and a new sequentia...

متن کامل

A Model for Bus Crew Scheduling Problem with Multiple Duty Types

This paper presents an approach for solving the bus crew scheduling problem which considers early, day, and late duty modes with time shift and work intensity constraints. Furthermore, the constraint with the least crew number of a certain duty e.g., day duty has also been considered. An optimization model is formulated as a 0-1 integer programming problem to improve the efficiency of crew sche...

متن کامل

An Improved Integer Local Search for Complex Scheduling Problems

We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many hard constraints as possible and meanwhile to minimize a penalty function determined by the unsatisfied soft constraints. We present an efficient local search algorithm for these problems which improves upon Wsat(oip), ...

متن کامل

A Mathematical Model and a Solution Method for Hybrid Flow Shop Scheduling

This paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. First, the problem is formulated as a mixed integer linear programming model. Then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. Two experiments are carried out to evaluate th...

متن کامل

Recent Advances in Exact Optimization of Airline Scheduling Problems

We discuss the formulation and solution of large scale integer optimization problems that arise in the scheduling of transport related services. We rst set the context for these problems within the airline industry by discussing the scheduling process. We then discuss the two key activities of eet assignment and crew scheduling that turn a schedule into an operational plan. We provide current f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999